Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

نویسنده

  • Agata Ciabattoni
چکیده

In this paper we define cut-free hypersequent calculi for some intermediate logics semantically characterized by bounded Kripke models. In particular we consider the logics characterized by Kripke models of bounded width Bwk, by Kripke models of bounded cardinality Bck and by linearly ordered Kripke models of bounded cardinality Gk. The latter family of logics coincides with finite-valued Gödel logics. Our calculi turn out to be very simple and natural. Indeed, for each family of logics (respectively, Bwk, Bck and Gk), they are defined by adding just one structural rule to a common system, namely the hypersequent calculus for Intuitionistic Logic. This structural rule reflects in a natural way the characteristic semantical features of the corresponding logic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypertableau and Path-Hypertableau Calculi for Some Families of Intermediate Logics

In this paper we investigate the tableau systems corresponding to hypersequent calculi. We call these systems hypertableau calculi. We define hypertableau calculi for some propositional intermediate logics. We then introduce path-hypertableau calculi which are simply defined by imposing additional structure on hypertableaux. Using pathhypertableaux we define analytic calculi for the intermediat...

متن کامل

Translating Labels to Hypersequents for Intermediate Logics with Geometric Kripke Semantics

We give a procedure for translating geometric Kripke frame axioms into structural hypersequent rules for the corresponding intermediate logics in Int/Geo that admit weakening, contraction and in some cases, cut. We give a procedure for translating labelled sequents in the corresponding logic to hypersequents that share the same linear models (which correspond to Gödel-Dummett logic). We prove t...

متن کامل

Intermediate logics admitting a structural hypersequent calculus

We characterise the intermediate logics which admit a cut-free hypersequent calculus of the form HLJ+ R, where HLJ is the hypersequent counterpart of the sequent calculus LJ for propositional intuitionistic logic, and R is a set of so-called structural hypersequent rules, i.e., rules not involving any logical connectives. The characterisation of this class of intermediate logics is presented bo...

متن کامل

One-step Heyting Algebras and Hypersequent Calculi with the Bounded Proof Property

We investigate proof-theoretic properties of hypersequent calculi for intermediate logics using algebraic methods. More precisely, we consider a new weakly analytic subformula property (the bounded proof property) of such calculi. Despite being strictly weaker than both cut-elimination and the subformula property this property is sufficient to ensure decidability of finitely axiomatised calculi...

متن کامل

Hypersequent and Labelled Calculi for Intermediate Logics

Hypersequent and labelled calculi are often viewed as antagonist formalisms to define cut-free calculi for non-classical logics. We focus on the class of intermediate logics to investigate the methods of turning Hilbert axioms into hypersequent rules and frame conditions into labelled rules. We show that these methods are closely related and we extend them to capture larger classes of intermedi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2001